Semistandard tableaux for Demazure characters (key polynomials) and their atoms
نویسندگان
چکیده
The Schur function indexed by a partition λ with at most n parts is the sum of the weight monomials for the Young tableaux of shape λ. Let π be an npermutation. We give two descriptions of the tableaux that contribute their monomials to the key polynomial indexed by π and λ. (These polynomials are the characters of the Demazure modules for GL(n).) The “atom” indexed by π is the sum of weight monomials of the tableaux whose right keys are the “key” tableau for π. Schur functions and key polynomials can be decomposed into sums of atoms. We also describe the tableaux that contribute to an atom, the tableaux that have a left key equal to a given key, and the tableaux that have a left key bounded below by a given key.
منابع مشابه
An explicit construction of type A Demazure atoms
Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Schützenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the right key...
متن کاملDemazure Atoms
Demazure characters can be decomposed into smaller pieces, called standard bases by Lascoux and Schützenberger. We prove that these polynomials, which we call Demazure atoms, are the same polynomials obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the key associated to a given semi-...
متن کاملRefinements of the Littlewood-Richardson Rule
In the prequel to this paper [5], we showed how results of Mason [11], [12] involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and Schützenberger [6]) could be used to define a new basis for the ring of quasisymmetric functions we call “Quasisymmetric Schur functions” (QS funct...
متن کاملPolynomials Defined by Tableaux and Linear Recurrences
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall–Littlewood polynomials and dual Grothendieck polynomials. The motivation behind this is that such recurrences...
متن کاملAnna Pun Drexel University “ On Decomposition of the Product of Demazure Atom and Demazure Characters ”
It is an open problem to prove the Schubert positivity property combinatorially. Recently Haglund, Mason, Remmel, van Willigenburg et al. have studied the skyline fillings (a tableau-combinatorial object giving a combinatorial description to nonsymmetric MacDonald polynomials , proved by Haglund, Haiman and Loehr) specifically for the case of Demazure atoms (atoms) and key polynomials (keys). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015